Probing Methods for Generalized Saddle-Point Problems
نویسندگان
چکیده
Several Schur complement-based preconditioners have been proposed for solving (generalized) saddlepoint problems. We consider probing-based methods for approximating those Schur complements in the preconditioners of the type proposed by [Murphy, Golub and Wathen ’00], [de Sturler and Liesen ’03] and [Siefert and de Sturler ’04]. This approach can be applied in similar preconditioners as well. We discuss the implementation of probing-based approximations to Schur complements. We consider the application of those approximations in preconditioners for Navier-Stokes problems and metal deformation problems. Finally, we present eigenvalue clustering for the preconditioned matrices, and convergence and timing results. These demonstrate the effectiveness of the proposed preconditioners with probing-based approximate Schur complements.
منابع مشابه
Generalized iterative methods for solving double saddle point problem
In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...
متن کاملProbing Methods for Saddle-point Problems
Abstract. Several Schur complement-based preconditioners have been proposed for solving (generalized) saddle-point problems. We consider matrices where the Schur complement has rapid decay over some graph known a priori. This occurs for many matrices arising from the discretization of systems of partial differential equations, and this graph is then related to the mesh. We propose the use of pr...
متن کاملNo . UIUCDCS - R - 2005 - 2540 UILU - ENG - 2005 - 1744 Probing Methods for Generalized Saddle - Point Problems
Several Schur complement-based preconditioners have been proposed for solving (generalized) saddlepoint problems. We consider probing-based methods for approximating those Schur complements in the preconditioners of the type proposed by [Murphy, Golub and Wathen ’00], [de Sturler and Liesen ’03] and [Siefert and de Sturler ’04]. This approach can be applied in similar preconditioners as well. W...
متن کاملA Generalization of Local Symmetric and Skew-symmetric Splitting Iteration Methods for Generalized Saddle Point Problems
In this paper, we further investigate the local Hermitian and skew-Hermitian splitting (LHSS) iteration method and the modified LHSS (MLHSS) iteration method for solving generalized nonsymmetric saddle point problems with nonzero (2,2) blocks. When A is non-symmetric positive definite, the convergence conditions are obtained, which generalize some results of Jiang and Cao [M.-Q. Jiang and Y. Ca...
متن کاملA modified inexact Uzawa A lgorithm for generalized saddle point problems
In this note, we discuss the convergence behavior of a modified inexact Uzawa algorithm for solving generalized saddle point problems, which is an extension of the result obtained in a recent paper [Z.H. Cao, Fast Uzawa algorithm for generalized saddle point problems, Appl. Numer. Math., 46 (2003) 157-171]. Keywords—Saddle point problem; Inexact Uzawa algorithm; Convergence behavior.
متن کامل